Complexity of Network Design for Private Communication and the P-vs-NP Question
نویسندگان
چکیده
منابع مشابه
Complexity of Network Design for Private Communication and the P-vs-NP Question
We investigate infeasibility issues arising along network design for information-theoretically secure cryptography. In particular, we consider the problem of communication in perfect privacy and formally relate it to graph augmentation problems and the P-vs-NP-question. Based on a game-theoretic privacy measure, we consider two optimization problems related to secure infrastructure design with ...
متن کاملOn the P versus NP intersected with co-NP question in communication complexity
We consider the analog of the P versus NP∩ co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation ¬f have small (poly-logarithmic in the number of variables) nondeterministic communication complexity, what is then its deterministic and/or probabilistic communication com...
متن کاملOn the metamathematics of the P vs. NP question
We review the work (from 1976 to 1996) by several researchers on the metamathematics of P vs. NP. That work points towards the possibility that, given some strong consistent axiomatic system S with a recursively enumerable set of theorems which includes arithmetic, for the R2 sentence 1⁄2P 1⁄4 NP that formalizes the P 1⁄4 NP hypothesis, S þ 1⁄2P 1⁄4 NP is consistent. We consider the work of sev...
متن کاملOn the P vs NP question: a proof of inequality
The analysis discussed in this paper is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem is derived, which is described by a Boolean function called “core function”. In this paper it is proved that the cost of the minimal implementation of core function increases with n exponentially. Since the synthesis of core functi...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2014
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2014.050222